Meaningless Sets in Infinitary Combinatory Logic
نویسندگان
چکیده
In this paper we study meaningless sets in infinitary combinatory logic. So far only a handful of meaningless sets were known. We show that there are uncountably many meaningless sets. As an application to the semantics of finite combinatory logics, we show that there exist uncountably many combinatory algebras that are not a lambda algebra. We also study ways of weakening the axioms of meaningless sets to get, not only sufficient, but also necessary conditions for having confluence and normalisation. 1998 ACM Subject Classification F.4.1 Mathematical Logic (F.1.1, I.2.2, I.2.3, I.2.4)
منابع مشابه
Weakening the Axiom of Overlap in Infinitary Lambda Calculus
In this paper we present a set of necessary and sufficient conditions on a set of lambda terms to serve as the set of meaningless terms in an infinitary bottom extension of lambda calculus. So far only a set of sufficient conditions was known for choosing a suitable set of meaningless terms to make this construction produce confluent extensions. The conditions covered the three main known examp...
متن کاملInfinitary Combinatory Reduction Systems
We define infinitary combinatory reduction systems (iCRSs). This provides the first extension of infinitary rewriting to higher-order rewriting. We lift two well-known results from infinitary term rewriting systems and infinitary λ-calculus to iCRSs: 1. every reduction sequence in a fully-extended left-linear iCRS is compressible to a reduction sequence of length at most ω, and 2. every complet...
متن کاملOn Undefined and Meaningless in Lambda Definability
We distinguish between undefined terms as used in lambda definability of partial recursive functions and meaningless terms as used in infinite lambda calculus for the infinitary terms models that generalise the Böhm model. While there are uncountable many known sets of meaningless terms, there are four known sets of undefined terms. Two of these four are sets of meaningless terms. In this paper...
متن کاملDecomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
The notion of a meaningless set has been defined for infinitary lambda calculus axiomatically. Standard examples of meaningless sets are sets of terms that have no head normal form, the set of terms without weak head normal form and the set of rootactive terms. The collection of meaningless sets is a lattice. In this paper, we study the way this lattices decompose as union of more elementary ke...
متن کاملLinear realizability and full completeness for typed lambda-calculi
We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λ-calculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models ov...
متن کامل